翻訳と辞書
Words near each other
・ Multiplicative function
・ Multiplicative group
・ Multiplicative group of integers modulo n
・ Multiplicative inverse
・ Multiplicative noise
・ Multiplicative number theory
・ Multiplicative order
・ Multiplicative partition
・ Multiplicative quantum number
・ Multiplicative sequence
・ Multiplicatively closed set
・ Multiplicity
・ Multiplicity (album)
・ Multiplicity (chemistry)
・ Multiplicity (film)
Multiplicity (mathematics)
・ Multiplicity (philosophy)
・ Multiplicity (psychology)
・ Multiplicity (software)
・ Multiplicity function for N noninteracting spins
・ Multiplicity of infection
・ Multiplicity of suits
・ Multiplicity-one theorem
・ Multiplier
・ Multiplier (economics)
・ Multiplier (Fourier analysis)
・ Multiplier (linguistics)
・ Multiplier algebra
・ Multiplier ideal
・ Multiplier uncertainty


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Multiplicity (mathematics) : ウィキペディア英語版
Multiplicity (mathematics)
In mathematics, the multiplicity of a member of a multiset is the number of times it appears in the multiset. For example, the number of times a given polynomial equation has a root at a given point.
The notion of multiplicity is important to be able to count correctly without specifying exceptions (for example, ''double roots'' counted twice). Hence the expression, "counted with multiplicity".
If multiplicity is ignored, this may be emphasized by counting the number of distinct elements, as in "the number of distinct roots". However, whenever a set (as opposed to multiset) is formed, multiplicity is automatically ignored, without requiring use of the term "distinct".
==Multiplicity of a prime factor==
(詳細はprime factorization, for example,
: 60 = 2 × 2 × 3 × 5
the multiplicity of the prime factor 2 is 2, while the multiplicity of each of the prime factors 3 and 5 is 1. Thus, 60 has 4 prime factors, but only 3 distinct prime factors.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Multiplicity (mathematics)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.